Matching, Euler tours and the Chinese postman
نویسندگان
چکیده
The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more general b-matching blossom algorithm. Algorithms for finding Euler tours and related problems are also discussed.
منابع مشابه
Approximating the length of Chinese postman tours
This article develops simple and easy-to-use approximation formulae for the length of a Chinese Postman Problem (CPP) optimal tour on directed and undirected strongly connected planar graphs as a function of the number of nodes and the number of arcs for graphs whose nodes are randomly distributed on a unit square area. These approximations, obtained from a multi-linear regression analysis, all...
متن کاملA Note on K-Best Solutions to the Chinese Postman Problem
The K-best problems on combinatorial optimization problems, in which K best solutions are considered instead of an optimal solution under the same conditions, have widely been studied. In this paper, we consider the K-best problem on the famous Chinese postman problem and develop an algorithm that nds K best solutions. The time complexity of our algorithm is O(S(n;m) + K(n + m + logK + nT (n +m...
متن کاملAnd a Chinese Postman
Looking at the world’s history, nothing very important happened in 1736. There was one exception, at least for mathematicians. Leonhard Euler wrote an article [3] with the title “Solutio Problematis ad Geometriam Situs Pertinentis”, a paper of 13 pages with 21 short paragraphs, published in St. Petersburg, Russia. The paper looks like treating a certain puzzle, and it did not receive much atten...
متن کاملParameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs
In the Directed k-Chinese Postman Problem (k-DCPP), we are given a connected weighted digraph G and asked to find k non-empty closed directed walks covering all arcs of G such that the total weight of the walks is minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124–128) asked for the parameterized complexity of k-DCPP when k is the parameter. We prove that the k-DCPP is fixed-...
متن کاملCapacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 5 شماره
صفحات -
تاریخ انتشار 1973